The longest ring embedding in faulty hypercube
نویسندگان
چکیده
In this paper, we show that the adjacency fault tolerance for property 2H of hypercube. We also show that the adjacency fault tolerance for Hamiltonian laceability of hypercube. Applying these results, we can construct the fault-free cycle with length 2 − 2 | Fv | +4 in Qn − Fv where Fv is the faulty vertices set with at least two black vertices and two white vertices with | Fv |≤ n− 1.
منابع مشابه
Distributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
To embed a ring in a hypercube is to find a Hamiltonian cycle through every node of the hypercube. It is obvious that no 2 n node Hamiltonian cycle exists in an n-dimensional faulty hypercube which has at least one faulty node. However, if a hypercube has faulty links only and the number of faulty links is at most n − 2, at least one 2 n -node Hamiltonian cycle can be found. In this paper, we p...
متن کاملDistributed Fault-Tolerant Embeddings of Rings in Incrementally Extensible Hypercubes with Unbounded Expansion
The Incrementally Extensible Hypercube (IEH) is a generalization of interconnection network that is derived from the hypercube. Unlike the hypercube, the IEH can be constructed for any number of nodes. That is, the IEH is incrementally expandable. In this paper, the problem of embedding and reconfiguring ring structures is considered in an IEH with faulty nodes. There are a novel embedding algo...
متن کاملDistributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...
متن کاملHamiltonian Cycle Embedding for Fault Tolerance in Dual-cube
The hypercube has been widely used as the interconnection network (IN) in parallel computers. However, the major drawback of the hypercube is the increase in the number of communication links for each node with the increase in the total number of nodes in the system. A dual-cube DC(m) has m + 1 links per node where m is the degree of a cluster (m-cube), one more link is used for connecting to a...
متن کاملFault Tolerance in Hypercubes
This paper describes different schemes for tolerating faults in hypercube multiprocessors. A study of hypercube algorithms reveals that in many cases, the computations that require local communication are mapped onto topologies such as meshes or rings and the hypercube topology is used for global data communication. Therefore, a faulty hypercube needs to be reconfigured to perform both local an...
متن کامل